Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D

نویسندگان

  • Takao Ito
  • Kazuo Misue
  • Jiro Tanaka
چکیده

Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the readability decreases when large-scale graphs are drawn. To maintain the readability in drawing large-scale graphs, we developed “sphere anchored maps,” in which nodes in one set are arranged on a sphere. We describe the layout method for sphere anchored maps and the results of our user study. The results of our study revealed that more clusters of free nodes can be found using sphere anchored maps than using circular anchored maps. Thus, our maps have high readability, particularly around anchors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anchored Maps: Visualization Techniques for Drawing Bipartite Graphs

A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipartite graph, the nodes in A, which are called “anchors,” are arranged on the circumference, and the nodes in B, which are called “free nodes,” are arranged at suitable positions in relation to the adjacent anchors. Thi...

متن کامل

Drawing bipartite graphs as anchored maps

A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipartite graph, the nodes in A, which are called “anchor nodes,” are arranged on the circumference, and the nodes in B, which are called “free nodes,” are arranged at suitable positions in relation to the adjacent anchor ...

متن کامل

Visualization of Documents and Concepts in Neuroinformatics with the 3D-SE Viewer

A new interactive visualization tool is proposed for mining text data from various fields of neuroscience. Applications to several text datasets are presented to demonstrate the capability of the proposed interactive tool to visualize complex relationships between pairs of lexical entities (with some semantic contents) such as terms, keywords, posters, or papers' abstracts. Implemented as a Jav...

متن کامل

Visual Analysis Tool for Bipartite Networks

To find hidden features of co-authoring relationships, we focused on drawing techniques for bipartite graphs. We previously developed a drawing method called “anchored maps”, which is used to depict bipartite graphs visually. In anchored maps, some nodes are restricted to certain positions, but others are left to be arranged freely. In this study, we used our method to depict co-authoring relat...

متن کامل

META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009